Tight approximation algorithm for connectivity augmentation problems
نویسندگان
چکیده
منابع مشابه
Tight Approximation Algorithm for Connectivity Augmentation Problems
The S-connectivity λG(u, v) of (u, v) in a graph G is the maximum number of uv-paths that no two of them have an edge or a node in S − {u, v} in common. The corresponding Connectivity Augmentation (CA) problem is: given a graph G0 = (V,E0), S ⊆ V , and requirements r(u, v) on V ×V , find a minimum size set F of new edges (any edge is allowed) so that λSG0+F (u, v) ≥ r(u, v) for all u, v ∈ V . E...
متن کاملtight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولEdge-Connectivity Augmentation Problems
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the augmentation problem. This problem has a wide variety [3-5, 10, 11, 14-201. If such a given condition is concerned with the vertexor edge-connectivity of a graph then the problem is referred to as the (vertexor edge-) connectivity augmentation problem. Frank and Ch...
متن کاملNC Approximation Algorithms for 2-Connectivity Augmentation in a Graph
Abst rac t . Given an undirected graph G = (V, E0) with IVI-n, and a feasible set E of m weighted edges on V, the optimal 2-edge (2-vertex) connectivity augmentation problem is to find a subset S* __ E such that G(V, E0 U S*) is 2-edge (2-vertex) connected and the weighted sum of edges in S* is minimized. We devise NC approximation algorithms for the optimal 2-edge connectivity and the optimal ...
متن کاملCombined Connectivity Augmentation and Orientation Problems
Two important branches of graph connectivity problems are connectivity augmentation, which consists of augmenting a graph by adding new edges so as to meet a specified target connectivity, and connectivity orientation, where the goal is to find an orientation of an undirected or mixed graph that satisfies some specified edge-connection property. In the present work an attempt is made to link th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2008
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2007.05.002